Dual-Field Arithmetic Unit for GF(p) and GF(2m)
نویسنده
چکیده
In this article we present a hardware solution for finite field arithmetic with application in asymmetric cryptography. It supports calculation in GF (p) as well as in GF (2). Addition and multiplication with interleaved modular reduction are the main functionality of the unit. Additional functions—like shift operations and integer incrementation—allow the calculation of the multiplicative inverse and covering all operations required to implement Elliptic Curve Cryptography. Redundant number representation and efficient modular reduction make it ready for future cryptographic bitlengths and allow operation at high clock frequency on moderate hardware resources.
منابع مشابه
Low-Power Design of a Functional Unit for Arithmetic in Finite Fields GF(p) and GF(2m)
Recent multi-application smart cards are equipped with powerful 32-bit RISC cores clocked at 33 MHz or even more. They are able to support a variety of public-key cryptosystems, including elliptic curve systems over prime fields GF(p) and binary fields GF(2) of arbitrary order. This flexibility is achieved by implementing the cryptographic primitives in software and taking advantage of dedicate...
متن کاملAutomatic Generation System for Multiple-Valued Galois-Field Parallel Multipliers
This paper presents a system for the automatic generation of Galois-field (GF) arithmetic circuits, named the GF Arithmetic Module Generator (GF-AMG). The proposed system employs a graph-based circuit description called the GF Arithmetic Circuit Graph (GF-ACG). First, we present an extension of the GF-ACG to handle GF(pm) (p ≥ 3) arithmetic circuits, which can be efficiently implemented by mult...
متن کاملVLSI Architectures for Multiplication in GF(2m) for Application Tailored Digital Signal Processors
Finite Field Arithmetic plays an important role in coding theory, cryptography and their applications. Several hardware solutions using Finite Field Arithmetic have already been developed but none of them are user programmable. This is probably one reason why BCH codes are not commonly used in mobile communication applications even though these codes have very desirable properties regarding bur...
متن کاملA High Speed, Optimized Multiplier Architecture for a DF-ECC Processor
This paper presents a High speed, optimized multiplier architecture for a dual-field (DF) processor for elliptic curve cryptography (ECC). This processor can support the required operations in both galois prime field GF(p) and binary field GF(2). The performance of the processor is enhanced by the judicious selection of proper type of coordinates in the arithmetic unit. The arithmetic unit is d...
متن کاملInstruction Set Extension for Fast Elliptic Curve Cryptography over Binary Finite Fields GF(2m)
The performance of elliptic curve (EC) cryptosystems depends essentially on efficient arithmetic in the underlying finite field. Binary finite fields GF(2m) have the advantage of “carry-free” addition. Multiplication, on the other hand, is rather costly since polynomial arithmetic is not supported by general-purpose processors. In this paper we propose a combined hardware/software approach to o...
متن کامل